منابع مشابه
Approximability of Latin Square Completion-Type Puzzles
Among many variations of pencil puzzles, Latin square Completion-Type puzzles (LSCP), such as Sudoku, Futoshiki and BlockSum, are quite popular for puzzle fans. Concerning these puzzles, the solvability has been investigated from the viewpoint of time complexity in the last decade; it has been shown that, in most of these puzzles, it is NP-complete to determine whether a given puzzle instance h...
متن کاملSolving Square Jigsaw Puzzles with Loop Constraints
We present a novel algorithm based on “loop constraints” for assembling non-overlapping square-piece jigsaw puzzles where the rotation and the position of each piece are unknown. Our algorithm finds small loops of puzzle pieces which form consistent cycles. These small loops are in turn aggregated into higher order “loops of loops” in a bottom-up fashion. In contrast to previous puzzle solvers ...
متن کاملModular square root puzzles: Design of non-parallelizable and non-interactive client puzzles
Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely on public key cryptography and perform expensive authentication handshakes may be an easy target. A well-known countermeasure against resource depletion attacks are client puzzles. The victimized server demands from the c...
متن کاملAn Improved Heuristic-based Approach for Solving Square Jigsaw Puzzles
An algorithm for assembling square jigsaw puzzles is presented. We commence by introducing criteria that govern the selection of proper jigsaw puzzle solving method for a given application. Our algorithm uses the gray level profiles of border pixels for local matching of the puzzle pieces. Unlike the classical best-first search, the algorithm simultaneously locates the neighbors of a puzzle pie...
متن کاملSolving Multiple Square Jigsaw Puzzles with Missing Piece
Puzzle solving is important in many applications, such as image editing [1], biology [5] and archaeology, to name a few. This work focuses on puzzles with square pieces. The problem is introduced by [2], where a greedy algorithm, as well as a benchmark, are proposed. The algorithm discussed in [8] improves the results by using a particle filter. Pomeranz et al. [6] introduce the first fully-aut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Transactions on Education
سال: 2013
ISSN: 1532-0545,1532-0545
DOI: 10.1287/ited.1120.0103